Almost sure convergence in distributed parameter identification algorithms under correlated noise
نویسندگان
چکیده
منابع مشابه
Almost sure convergence of randomly truncated stochastic algorithms under verifiable conditions
Abstract. In this paper, we are interested in the almost sure convergence of randomly truncated stochastic algorithms. In their pioneer work, Chen and Zhu (1986) required that the family of the noise terms is summable to ensure the convergence. In our paper, we present a new convergence theorem which extends the already known results by making vanish this condition on the noise terms — a condit...
متن کاملAlmost Sure Convergence of Kernel Bivariate Distribution Function Estimator under Negative Association
Let {Xn ,n=>1} be a strictly stationary sequence of negatively associated random variables, with common distribution function F. In this paper, we consider the estimation of the two-dimensional distribution function of (X1, Xk+1) for fixed $K /in N$ based on kernel type estimators. We introduce asymptotic normality and properties and moments. From these we derive the optimal bandwidth...
متن کاملAlmost sure convergence of the Bartlett estimator
We study the almost sure convergence of the Bartlett estimator for the asymptotic variance of the sample mean of a stationary weekly dependent process. We also study the a. s. behavior of this estimator in the case of long-range dependent observations. In the weakly dependent case, we establish conditions under which the estimator is strongly consistent. We also show that, after appropriate nor...
متن کاملAlmost sure convergence, convergence in probability and asymptotic normality
In the previous chapter we considered estimator of several different parameters. The hope is that as the sample size increases the estimator should get ‘closer’ to the parameter of interest. When we say closer we mean to converge. In the classical sense the sequence {xk} converges to x (xk → x), if |xk − x| → 0 as k → ∞ (or for every ε > 0, there exists an n where for all k > n, |xk − x| < ε). ...
متن کاملJakimovski Methods and Almost-Sure Convergence
The classical summability methods of Borel (B) and Euler (E(λ), λ > 0) play an important role in many areas of mathematics. For instance, in summability theory they are perhaps the most important methods other than the Cesàro (Cα) and Abel (A) methods, and two chapters of the classic book of Hardy (1949) are devoted to them. In probability, the distinction between methods of Cesàro-Abel and Eul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1992
ISSN: 0893-9659
DOI: 10.1016/0893-9659(92)90083-l